Iterative inversion algorithm for an interference correlation matrix
نویسندگان
چکیده
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملAn Iterative Pipelined Array Architecture for the Generalized Matrix Inversion
This paper introduces a matrix inversion procedure suitable for iteratbve pipelining [5] and VLSI chip design. This procedure requires computation of the matrix-vector product, the inner and outer vector products as basic operations. Unlike other algorithms previously described in [4,6], the algorithm to be described here is fail-safe since it computes the Moore-Penrose generalized inverse of a...
متن کاملAn Efficient and Simple Algorithm for Matrix Inversion
In this paper, a new algorithm is proposed for finding inverse and determinant of a given matrix in one instance. The algorithm is straightforward in understanding and manual calculations. Computer implementation of the algorithm is extremely simple and is quite efficient in time and memory utilization. The algorithm is supported by an example. The number of multiplication/division performed by...
متن کاملAn Efficient and Generic Algorithm for Matrix Inversion
This work presents an improvement on the simple algorithms of matrix inversion (Farooq & Hamid, 2010). This generalized algorithm supports selection of pivot randomly in the matrix thus supporting partial and full pivoting. The freedom in pivot selection can be used in minimizing the numerical error and prioritizing the variable to find the solution first. The algorithm is more suitable for fin...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of «Almaz – Antey» Air and Space Defence Corporation
سال: 2017
ISSN: 2542-0542
DOI: 10.38013/2542-0542-2017-2-4-9